|
Richard Peirce Brent (born 20 April 1946, Melbourne) is an Australian mathematician and computer scientist. He is an emeritus professor at the Australian National University and a conjoint professor at the University of Newcastle (Australia). From March 2005 to March 2010 he was a Federation Fellow〔(Federation Fellowships Funding Outcomes 2004 ). Australian Research Council〕 at the Australian National University. His research interests include number theory (in particular factorisation), random number generators, computer architecture, and analysis of algorithms. In 1973, he published a root-finding algorithm (an algorithm for solving equations numerically) which is now known as Brent's method.〔Brent (1973). ''Algorithms for Minimization without Derivatives.'' Prentice-Hall, Englewood Cliffs, NJ. Reprinted by Dover Publications, Mineola, New York, 2002 and 2013. ISBN 0-486-41998-3. (Original edition ) is available on his own professional web page at ANU.〕 In 1975 he and Eugene Salamin independently conceived the Salamin–Brent algorithm, used in high-precision calculation of . At the same time, he showed that all the elementary functions (such as log(''x''), sin(''x'') etc.) can be evaluated to high precision in the same time as (apart from a small constant factor) using the arithmetic-geometric mean of Carl Friedrich Gauss. In 1979 he showed that the first 75 million complex zeros of the Riemann zeta function lie on the critical line, providing some experimental evidence for the Riemann hypothesis. In 1980 he and Nobel laureate Edwin McMillan found a new algorithm for high-precision computation of the Euler–Mascheroni constant using Bessel functions, and showed that can not have a simple rational form ''p''/''q'' (where ''p'' and ''q'' are integers) unless ''q'' is extremely large (greater than 1015000).〔Brent, R.P. and MacMillan, E.M. (1980). "(Some New Algorithms for High-Precision Computation of Euler's Constant )". ''Mathematics of Computation'' 34 (149) 305-312.〕 In 1980 he and John Pollard factored the eighth Fermat number using a variant of the Pollard rho algorithm. He later factored the tenth and eleventh Fermat numbers using Lenstra's elliptic curve factorisation algorithm. In 2002, Brent, Samuli Larvala and Paul Zimmermann discovered a very large primitive trinomial over GF(2): : The degree 6972593 is the exponent of a Mersenne prime.〔Brent, R.P. and Larvala, S. and Zimmerman, P. (2005). "(A primitive trinomial of degree 6972593 )". ''Mathematics of Computation'' 74 (250) 1001-1002.〕 In 2009, Brent and Paul Zimmermann discovered some even larger primitive trinomials, for example: : The degree 43112609 is again the exponent of a Mersenne prime.〔Brent, R.P. and Zimmerman, P. (2011). "(The great trinomial hunt )". ''Notices of the American Mathematical Society'' 58 233-239.〕 In 2010, Brent and Paul Zimmermann published "Modern Computer Arithmetic", (Cambridge University Press, 2010), a book about algorithms for performing arithmetic, and their implementation on modern computers. Brent is a Fellow of the Association for Computing Machinery, the IEEE, SIAM and the Australian Academy of Science. In 2005, he was awarded the Hannan Medal by the Australian Academy of Science. ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Richard P. Brent」の詳細全文を読む スポンサード リンク
|